Balanced allocation and dictionaries with tightly packed constant size bins
نویسندگان
چکیده
منابع مشابه
Balanced Allocation and Dictionaries with Tightly Packed Constant Size Bins
We study a particular aspect of the balanced allocation paradigm (also known as the “twochoices paradigm”): constant sized bins, packed as tightly as possible. Let d ≥ 1 be fixed, and assume there are m bins of capacity d each. To each of n ≤ dm balls two possible bins are assigned at random. How close can dm/n = 1+ε be to 1 so that with high probability each ball can be put into one of the two...
متن کاملBalanced offline allocation of weighted balls into bins
We propose a sorting-based greedy algorithm called SortedGreedy[m] for approximately solving the offline version of the d-choice weighted balls-into-bins problem where the number of choices for each ball is equal to the number of bins. We assume the ball weights to be nonnegative. We compare the performance of the sorting-based algorithm with a näıve algorithm called Greedy[m]. We show that by ...
متن کاملBalanced Allocations: Balls-into-Bins Revisited and Chains-into-Bins
The study of balls-into-bins games or occupancy problems has a long history since these processes can be used to translate realistic problems into mathematical ones in a natural way. In general, the goal of a balls-into-bins game is to allocate a set of independent objects (tasks, jobs, balls) to a set of resources (servers, bins, urns) and, thereby, to minimize the maximum load. In this paper ...
متن کاملPerfectly Balanced Allocation With Estimated Average Using Expected Constant Retries
Balanced allocation of online balls-into-bins has long been an active area of research for efficient load balancing and hashing applications. There exists a large number of results in this domain for different settings, such as parallel allocations [1], multi-dimensional allocations [5], weighted balls [4] etc. For sequential multi-choice allocation, where m balls are thrown into n bins with ea...
متن کاملTightly Secure IBE Under Constant-Size Master Public Key
Chen and Wee [CRYPTO, 2013] proposed the first almost tightly and adaptively secure IBE in the standard model and left two open problems which called for a tightly secure IBE with (1) constant-size master public key and/or (2) constant security loss. In this paper, we propose an IBE scheme with constant-size master public key and tighter security reduction. This (partially) solves Chen and Wee’...
متن کاملذخیره در منابع من
با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید
ژورنال
عنوان ژورنال: Theoretical Computer Science
سال: 2007
ISSN: 0304-3975
DOI: 10.1016/j.tcs.2007.02.054